Decision Tree Grafting
نویسنده
چکیده
This paper extends recent work on decision tree grafting. Grafting is an inductive process that adds nodes to inferred decision trees. This process is demonstrated to frequently improve predictive accuracy. Superficial analysis might suggest that decision tree grafting is the direct reverse of pruning. To the contrary, it is argued that the two processes are complementary. This is because, like standard tree growing techniques, pruning uses only local information, whereas grafting uses non-local information. The use of both pruning and grafting in conjunction is demonstrated to provide the best general predictive accuracy over a representative selection of learning tasks.
منابع مشابه
Decision Tree Grafting From the All Tests But One Partition
Decision tree grafting adds nodes to an existing decision tree with the objective of reducing prediction error. A new grafting algorithm is presented that considers one set of training data only for each leaf of the initial decision tree, the set of cases that fail at most one test on the path to the leaf. This new technique is demonstrated to retain the error reduction power of the original gr...
متن کاملThe Problem of Missing Values in Decision Tree Grafting
Decision tree grafting adds nodes to inferred decision trees. Previous research has demonstrated that appropriate grafting techniques can improve predictive accuracy across a wide cross-selection of domains. However, previous decision tree grafting systems are demonstrated to have a serious deeciency for some data sets containing missing values. This problem arises due to the method for handlin...
متن کاملA decision tree for soft tissue grafting.
Periodontal plastic surgery is commonly performed for esthetic and physiologic reasons, such as alleviating root sensitivity, root caries, and cervical abrasion and facilitating plaque control at the affected site. Currently, there is a lack of information regarding the most appropriate treatment method for the various clinical situations encountered. The aims of this paper are to review and di...
متن کاملSubtree Replacement in Decision Tree Simplification
The current availability of efficient algorithms for decision tree induction makes intricate post-processing techniques worth to be investigated both for efficiency and effectiveness. We study the simplification operator of subtree replacement, also known as grafting, originally implemented in the C4.5 system. We present a parametric bottom-up algorithm integrating grafting with the standard pr...
متن کاملEnsembles of Grafted Trees
Grafted trees are trees that are constructed using two methods. The first method creates an initial tree, while the second method is used to complete the tree. In this work, the first classifier is an unpruned tree from a 10% sample of the training data. Grafting is a method for constructing ensembles of decision trees, where each tree is a grafted tree. Grafting by itself is better than Baggin...
متن کامل